Groups that Distribute over Stars

نویسندگان

  • Arthur Holshouser
  • Harold Reiter
چکیده

Suppose (S, ∗) is a mathematical structure on a set S. As examples, (S, ∗) might be a topological space on S, a topological group on S, an n-ary operator on S, an n-ary relation on S or a Steiner triple system on S. A similarity mapping on (S, ∗) is a permutation on S that preserves the structure of (S, ∗). Such mappings f : (S, ∗) → (S, ∗) are called by different names. As examples, f might be called a homeomorphism or an automorphism on (S, ∗). See [5] for the details. Suppose (S, ·) is a group on S. For each fixed t in S, the left and right translation on S are the permutations Lt (x) = t · x and Rt (x) = x · t respectively. They are called the left and right translation by t. See [1] and [5]. We say that the group (S, ·) left-distributes or right-distributes over (S, ∗) if respectively for all t in S,Lt (x) : (S, ∗) → (S, ∗) or Rt (x) : (S, ∗) → (S, ∗) is a similarity mapping on (S, ∗). In case S = (R, 0,+), the additive group of real numbers with the usual topology, addition both left and right distributes over the topological space (R, T ) because, for every open set U and every x ∈ R, U + x = x+ U is an open set. See [5] for more examples. In this paper, we give a naturally occurring example that involves what we call an n-star which is structurally the same as n lines in the plane intersecting in (2 ) distinct points. However, an equally important purpose of this paper is to show that if a structure (S, ∗) is given, then a fundamental idea is to see if a group (S, ·) exists such that (S, ·) left-distributes or right-distributes over (S, ∗) . The only prerequisites for reading this paper is a very basic knowledge of set theory, group theory and the mod p field Zp = ({0, 1, 2 . . . , p− 1}, 0, 1,+, ·), where p is a prime.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Groups that Distribute over Stars

In the paper “Groups that Distribute over Mathematical Structures”, [5], we stated that a group (S, ·) on a set S left (or right) distributes over an arbitrary mathematical structure (S, ∗) on the same set S if and only if respectively for all fixed t ∈ S the permutation Lt (x) = t · x (or Rt (x) = x · t) is a similarity mapping on (S, ∗). A similarity mapping f on (S, ∗) is a permutation on S ...

متن کامل

Forty Years of X-Ray Binaries

In 2012 it was forty years ago that the discovery of the first X-ray binary Centaurus X-3 became known. That same year it was discovered that apart from the High-Mass X-ray Binaries (HMXBs) there are also Low-Mass X-ray Binaries (LMXBs), and that Cygnus X-1 is most probably a black hole. By 1975 also the new class of Be/X-ray binaries was discovered. After this it took 28 years before ESAs INTE...

متن کامل

Groups that Distribute over n-Stars

Suppose (S, ∗) is a mathematical structure on a set S. As examples, (S, ∗) might be a topological space on S, a topological group on S, an n-ary operator on S, an n-ary relation on S or a Steiner triple system on S. A similarity mapping on (S, ∗) is a permutation on S that preserves the structure of (S, ∗). Such mappings f : (S, ∗) → (S, ∗) are called by different names. As examples, f might be...

متن کامل

ar X iv : a st ro - p h / 07 01 34 6 v 1 1 1 Ja n 20 07 Young Stellar Groups Around Herbig Ae / Be Stars : A Low - Mass YSO Census

We present NIR and MIR observations of eight embedded young stellar groups around Herbig Ae/Be stars (HAEBEs) using archived Spitzer IRAC data and 2MASS data. These young stellar groups are nearby (≤ 1 kpc) and still embedded within their molecular clouds. In order to identify the young stellar objects in our sample, we use the color-color diagram of J [3.6] vs. Ks [4.5]. The Spitzer images of ...

متن کامل

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

[Relations between reward-distribution patterns and distribution strategies: how five-year-old children distribute rewards].

The relationship between children's reward-distribution judgments and their distribution strategies was investigated. Five-year-old children (N = 61) were presented with two stories where two characters made different numbers of origami stars. The children were asked to distribute different numbers of rewards to the characters: equal to (Middle-N), less than (Small-N), or more than (Large-N) th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008